home *** CD-ROM | disk | FTP | other *** search
- Future plans:
-
- o #(ba) is relatively inefficient. That is because it always moves memory
- around to give the current buffer 64K. I plan to change this so that memory
- is only moved when you run out of memory in a particular buffer. In the
- mean time, #(ba,number,x) where x is non-null will move you from buffer to
- buffer without moving memory. The price that you pay for this is that the
- buffer you move to will not have any free space, and so no inserting can
- be done. Note that buffer one is special in that an attempt is made to
- ensure that it always has 2000 free bytes. This makes
- #(Fkill-to-buffer-one) a lot more efficient. After I improve #(ba), buffer
- one will no longer be special.
-
- o #(sa) uses a bubble sort. I ran across a shell sort in assembly and so I
- will incorporate that in.
-
- o Free space is limited, and in fact, is almost at the bare minimum. This is
- because I use one 64K segment for everything except text buffers. I plan
- to create three segments: one for everything but MINT code, and two for
- the MINT code. This will mean big changes in mintform.asm and mintprim.asm
- and probably emacs.asm also.
-